Recognizing Pseudo-intents is coNP-complete
نویسندگان
چکیده
The problem of recognizing whether a subset of attributes is a pseudo-intent is shown to be coNP-hard, which together with the previous results means that this problem is coNP-complete. Recognizing an essential intent is shown to be NP-complete and recognizing the lectically largest pseudo-intent is shown to be coNP-hard.
منابع مشابه
Some Computational Problems Related to Pseudo-intents
We investigate the computational complexity of several decision, enumeration and counting problems related to pseudo-intents. We show that given a formal context and a set of its pseudo-intents, checking whether this context has an additional pseudo-intent is in conp and it is at least as hard as checking whether a given simple hypergraph is saturated. We also show that recognizing the set of p...
متن کاملTowards the Complexity of Recognizing Pseudo-intents
Pseudo-intents play a key rôle in Formal Concept Analysis. They are the premises of the implications in the Duquenne-Guigues Base, which is a minimum cardinality base for the set of implications that hold in a formal context. It has been shown that checking whether a set is a pseudo-intent is in conp. However, it is still open whether this problem is conp-hard, or it is solvable in polynomial t...
متن کاملCounting Pseudo-intents and #P-completeness
Implications of a formal context (G,M, I) have a minimal implication basis, called Duquenne-Guigues basis or stem base. It is shown that the problem of deciding whether a set of attributes is a premise of the stem base is in coNP and determining the size of the stem base is polynomially Turing equivalent to a #P-complete problem.
متن کاملSome Open Problems in Formal Concept Analysis
This note intends to collect some open problems in Formal Concept Analysis. The ones below have been presented at the International Conference on Formal Concept Analysis (ICFCA 2006) held in Dresden February 2006. Would you like to add some problems to this list, please feel free to send them to [email protected] Problems presented at ICFCA 2006 in Dresden Problem 1 (Minimal generators for B...
متن کاملOn the complexity of enumerating pseudo-intents
We investigate whether the pseudo-intents of a given formal context can efficiently be enumerated. We show that they cannot be enumerated in a specified lexicographic order with polynomial delay unless p = np. Furthermore we show that if the restriction on the order of enumeration is removed, then the problem becomes at least as hard as enumerating minimal transversals of a given hypergraph. We...
متن کامل